Bipartite matching extendable graphs
نویسندگان
چکیده
Matching extendability is significant in graph theory and its applications. The basic notion in this direction is n-extendability introduced by Plummer in 1980. Motivated by the different natures of bipartite matchings and non-bipartite matchings, this paper investigates bipartite-matching extendable (BM-extendable) graphs. A graph G is said to be BM-extendable if every matching M which is a perfect matching of an induced bipartite subgraph can be extended to a perfect matching. Our main results are showing that the recognition of BM-extendable graphs is co-NP-complete and characterizing some classes of BM-extendable graphs. c © 2008 Published by Elsevier B.V.
منابع مشابه
Construction characterizations for defect n - extendable bipartite graphs ∗
A near perfect matching is a matching covering all but one vertex in a graph. Let G be a connected graph and n ≤ (|V (G)|−2)/2 be a positive integer. If any n independent edges in G are contained in a near perfect matching, then G is said to be defect n-extendable. This paper presents two construction characterizations of defect n-extendable bipartite graphs and a necessary condition for minima...
متن کاملConstruction for bicritical graphs and k-extendable bipartite graphs
A graphG is said to be bicritical ifG−u− v has a perfect matching for every choice of a pair of points u and v. Bicritical graphs play a central role in decomposition theory of elementary graphs with respect to perfect matchings. As Plummer pointed out many times, the structure of bicritical graphs is far from completely understood. This paper presents a concise structure characterization on bi...
متن کاملConnectivity of k-extendable graphs with large k
Let G be a simple connected graph on 2n vertices with perfect matching. For a given positive integer k (06 k6 n − 1), G is k-extendable if any matching of size k in G is contained in a perfect matching of G. It is proved that if G is a k-extendable graph on 2n vertices with k¿ n=2, then either G is bipartite or the connectivity of G is at least 2k. As a corollary, we show that if G is a maximal...
متن کاملCharacterizing minimally n-extendable bipartite graphs
In this paper, it is proved that let G be a bipartite graph with bipartition (X, Y ) and with a perfect matching M , let G be an n-extendable graph, then G is minimally n-extendable if and only if, for any two vertices x ∈ X and y ∈ Y such that xy ∈ E(G), there are exactly n internally disjoint (x, y) M-alternating paths P1, P2, . . . , Pn such that Pi (1 i n) starts and ends with edges in E(G)...
متن کاملSURFACE EMBEDDING OF NON-BIPARTITE k-EXTENDABLE GRAPHS
We find the minimum number k = μ(Σ) for any surface Σ, such that every Σ-embeddable non-bipartite graph is not k-extendable. In particular, we construct the so-called bow-tie graphs C6 ⊲⊳ Pn, and show that they are 3-extendable. This confirms the existence of an infinite number of 3-extendable non-bipartite graphs which can be embedded in the Klein bottle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008